Ma 134. Syllabus. Spring 2008.

 

Lectures:

Instructor: Pavel Dubovski, pdubovsk @ stevens

134A: MW 12:00-12:50  Pierce 116.

134B: MW 10:00-10:50  McLean 104.

Office hours: Kidde 226,  MW 2-3pm and by appointment.

 

Recitation classes:

Instructor: Michael Engling, menglin @ stevens

134RA: Friday 10:00-10:50  Babbio 320.

134RB: Friday 11:00-11:50  Babbio 320.

134RC: Friday 12:00-12:50  Morton 105.

134RD: Friday 2:00-2:50  Morton 103.

 

 

Textbook:

[1] Rosen, K.H., “Discrete Mathematics and its Applications”, 6th edition (McGraw Hill).

[2] Bauer, D., “Lecture Notes in Discrete Math”, Stevens Tech edition.

 

 

  1. Logic (1.1-1.5, 11.1-11.2, 11.4)
  2. Methods of proof (1.6-1.7)
  3. Sets (2.1-2.2)
  4. Functions, sequences, and cardinality (2.3-2.4)
  5. Growth of functions, Complexity of algorithms  (3.1-3.3)
  6. Elements of Number theory and Cryptology (3.4-3.7)
  7. Mathematical Induction (4.1-4.2)
  8. Recursion and program correctness (4.3-4.5)
  9. Midterm Exam
  10. Counting (5.1-5.6, 7.1-7.6)
  11. Relations (8.1-8.6)
  12. Graph Theory (9.1-9.8, 10.1-10.5)

 

 

Grading:

Weekly HWs: 10%

Midterm exams – 30%

Project – 20%

Final (cumulative) – 40%

Bonuses (class activity and bonus problems) – up to 5%